FDL - Nuprl Lemma : pred-first-lemma

Nuprl Lemma : pred-first-lemma

E:Type, pred?:(E

(?E)), n:

, a, j:E.
(

first(j))

(rel_exp(E;

x,y. (

(

first(y))) c

(x = pred(y)

E);n)(a,j))

(a = j)

Definitions b, P Q, x:A. B(x), A c B, a < b, P & Q, x f y, rel_exp(T;R;n), x.A(x), A, first(e), s = t, pred(e), n - m, x:A. B(x), P Q, f(a), "$token", outl(x), if a=b then c else d, (i = j), Y, isl(x), case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , b, , t T, Unit, left + right, x:AB(x), <a, b>, False, x:A B(x), #$n, A B, -n, n+m, Void, {x:A| B(x)} , , Type, , , P Q, i j , True, T, tt, {T}, SQType(T), s ~ t, P Q

Lemmas bool sq, assert elim, squash wf, true wf, ge wf, nat properties, unit wf, nat wf, eqtt to assert, eqff to assert, iff transitivity, assert of bnot, not functionality wrt iff, assert of eq int, eq int wf, bool wf, bnot wf, rel exp wf, not wf, pred wf, le wf, assert wf, first wf